package com.wyp168.leetcode;

/**
 * @ClassName DivideSolution
 * @Title TODO leetcode 29:两数相除【Middle】
 * @Description TODO
 * @Author wyp168
 * @Date 2022/10/20 22:27
 */
public class DivideSolution {
    public static void main(String[] args) {
        DivideSolution solution = new DivideSolution();
        int dividend = -2147483648;
        int divisor = -1017100424;

        System.out.println(solution.divide(dividend, divisor));
//        System.out.println(Integer.parseInt("-"));

//        System.out.println(Integer.MAX_VALUE);

        //-2147483648

//        System.out.println(1 << 31 - 1);
    }

    /**
     *
     * @param dividend 被除数
     * @param divisor 除数
     * @return
     */
    public int divide(int dividend, int divisor) {
        //TODO  待写
        return 1;
    }

}
